Perfect Circular Arc Coloring

نویسندگان

Xujin Chen

Zhiquan Hu

Wenan Zang

چکیده

The circular arc coloring problem is to find a minimum coloring of a set of arcs of a circle so that no two overlapping arcs share a color. This N P-hard problem arises in a rich variety of applications and has been studied extensively. In this paper we present an O(n2m) combinatorial algorithm for optimally coloring any set of arcs that corresponds to a perfect graph, and propose a new approach to the general circular arc coloring problem.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On k-Coloring of Weighted Circular-Arc Graphs

The problem of coloring a subgraph of any weighted circular-arc graph with a set of k colors is studied in this paper. In such a coloring, two overlapping arcs must receive different colors. Our main result is to derive a 2-approximation algorithm for the NP-hard problem of finding a maximum total weight k-colorable subgraph of any weighted circular-arc graph, and this algorithm runs in O(mloge...

متن کامل

A Note on Circular Arc Online Coloring using First Fit

In [1] using a column construction technique it is proved that every interval graph can be colored online with First Fit with at most 8w(G) colors, where w(G) is the size of the maximum clique of G. Since the column construction can not be adapted to circular arc graphs we give a different proof to establish an upper bound of 9w(G) for online coloring a circular arc graph G with the First Fit a...

متن کامل

An Approximation Algorithm for Coloring Circular-arc Graphs

Consider families of arcs on a circle. The minimum coloring problem on arc families has been shown to be NP-hard by Garey, Johnson, Miller and Papadimitriou. It is easy to show that 2q colors are sufficient for any arc family F, where q is the size of a maximum clique in F and 3q/2 colors are necessary for some families. It has long been open problem to find a coloring algorithm which uses no m...

متن کامل

Computing and Counting Longest Paths on Circular-Arc Graphs in Polynomial Time

The longest path problem asks for a path with the largest number of vertices in a given graph. In contrast to the Hamiltonian path problem, until recently polynomial algorithms for the longest path problem were known only for small graph classes, such as trees. Recently, a polynomial algorithm for this problem on interval graphs has been presented in Ioannidou et al. (2011) [19] with running ti...

متن کامل